0 Quantum Algorithms for Finding Claws , Collisions and Triangles ∗
نویسندگان
چکیده
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an N3/4 logN quantum upper bound for the element distinctness problem (contrasting with N logN classical complexity). We also give an algorithm to finding a triangle in a graph more efficiently than classically.
منابع مشابه
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N3=4 logN) quantum upper bound for the element distinctness problem in the comparison complexity model. This contrasts with (N logN) classical complexity. We also prove a lower bound of ...
متن کاملQuantum Algorithm for the Collision Problem
In this note, we give a quantum algorithm that finds collisions in arbitrary r-to-one functions after only O( 3 √ N/r ) expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabilism. We also give a similar algorithm for finding claws in pairs of functions. Furthermore, we exhibit ...
متن کاملSimilarity between Grover’s quantum search algorithm and classical two-body collisions
By studying the diffusion operator in Grover’s quantum search algorithm, we find a mathematical analogy between quantum searching and classical, elastic two-body collisions. We exploit this analogy using a thought experiment involving multiple collisions between two-bodies to help illuminate why Grover’s quantum search algorithm works. Related issues are discussed. PACS numbers: 03.67. Quantum ...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کامل